Distributionally Robust Model Predictive Control With Total Variation Distance
نویسندگان
چکیده
This paper studies the problem of distributionally robust model predictive control (MPC) using total variation distance ambiguity sets. For a discrete-time linear system with additive disturbances, we provide conditional value-at-risk reformulation MPC optimization that is in expected cost and chance constraints. The constraint over-approximated as simpler, tightened reduces computational burden. Numerical experiments support our results on probabilistic guarantees efficiency.
منابع مشابه
Distributionally Robust Newsvendor Problems with Variation Distance
We use distributionally robust stochastic programs (DRSP) to model a general class of newsvendor problems where the underlying demand distribution is unknown, and so the goal is to find an order quantity that minimizes the worst-case expected cost among an ambiguity set of distributions. The ambiguity set consists of those distributions that are not far—in the sense of the so-called variation d...
متن کاملDistributionally Robust Stochastic Optimization with Wasserstein Distance
Distributionally robust stochastic optimization (DRSO) is a robust approach to stochastic optimization problems in which the underlying distribution is not known exactly. It seeks a decision which hedges against the worst-case distribution in an ambiguity set, containing a family of distributions relevant to the considered problem. Unfortunately, the worst-case distributions resulting from many...
متن کاملWasserstein distance and the distributionally robust TSP
Recent research on the robust and stochastic travelling salesman problem and the vehicle routing problem has seen many different approaches for describing the region of ambiguity, such as taking convex combinations of observed demand vectors or imposing constraints on the moments of the spatial demand distribution. One approach that has been used outside the transportation sector is the use of ...
متن کاملIdentifying Effective Scenarios in Distributionally Robust Stochastic Programs with Variation Distance
Traditional stochastic programs assume that the probability distribution of uncertainty is known. However, in practice, the probability distribution oftentimes is not known or cannot be accurately approximated. One way to address such distributional ambiguity is to work with distributionally robust convex stochastic programs (DRSPs), which minimize the worst-case expected cost with respect to a...
متن کاملRobust Model Predictive Control
The robust control problem concerns to the control of plants that are only approximately known. Usually, it is assumed that the plant lies in a set of possible plants and this set can be quantitatively characterized. It is sought a control design that assures some kind of performance, which includes stability, for all the members of the family of candidate plants. Robust control theory usually ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Control Systems Letters
سال: 2022
ISSN: ['2475-1456']
DOI: https://doi.org/10.1109/lcsys.2022.3184921